Traditional spectral clustering algorithms are difficult to be applied to large-scale hyperspectral images， and the existing improved spectral clustering algorithms are not effective in processing large-scale hyperspectral images. To address these problems， a hyperspectral clustering algorithm based on double dimension-reduction of super-pixel and anchor graph was proposed to reduce the complexity of clustering data that is to reduce the computational cost of clustering process， thereby improving the clustering performance in many aspects. Firstly， Principal Component Analysis （PCA） was performed to the hyperspectral image data， and dimension-reduction was carried out to the data based on super-pixel segmentation according to the regional characteristics of hyperspectral image. Then， the anchor points of the data obtained in previous step were selected with the idea of constructing anchor graph. And the adjacent anchor graph was constructed to achieve double dimension-reduction for spectral clustering. At the same time， in order to remove the artificial adjustment of parameters in the operation of the algorithm， a kernel-free anchor graph construction method with the Gaussian kernel removed was used in the construction of anchor graph to achieve automatic graph construction. Experimental results on Indian Pines dataset and Salinas dataset show that the proposed algorithm can improve the overall effects of clustering with guaranteeing availability and low time consumption， thus verifying that the proposed algorithm can improve the quality and performance of clustering.

Aiming at the multi?classification problem for Motor Imagery ElectroEncephaloGraphy （MI?EEG）， Lightweight convolutional neural Network （L?Net） and Lightweight Hybrid Network （LH?Net） based on deep separable convolution were built on the basis of existing research. Experiments and analyses were carried out on the BCI competition IV-2a data set. It was shown that L?Net could fit the data faster than LH?Net， and the training time was shorter. However， LH?Net is more stable than L?Net and has better robustness in classification performance on the test set， the average accuracy and average Kappa coefficient of LH?Net were increased by 3.6% and 4.8%， respectively compared with L?Net. In order to further improve the classification performance of the model， a new method of adding Gaussian noise based on the time?frequency domain was adopted to apply Data Augmentation （DA） on the training samples， and simulation verification of the noise intensity was carried out， thus the optimal noise intensity ranges of the two models were inferred. With the DA method， the average accuracies of the two models were increased by at least 4% in the simulation results， the four classification effects were significantly improved.

The UMHexagonS motion estimation algorithm in H.264 was studied, and an improved fast motion estimation algorithm was proposed. First, the fixed search range, the unsymmetrical cross search, the 5×5 small rectangular spiral search, the uneven multi-hexagon-grid search and the extended hexagon-based search were analyzed. Then the optimized search modes were given respectively, which called dynamic search window, adaptive rood pattern search, the directional 3×3 small rectangular search pattern, the predictive intensive direction search and the modified extended hexagon-based search. Thus Adaptive Pattern Direction Search (APDS) algorithm was formed by these optimized search modes. The experimental results conducted on different test sequences show that, compared to UMHexagonS algorithm, the APDS algorithm can save about 29.64% Motion Estimation (ME) time and reduce the average number of checking points per Motion Vector (MV) generation about 21.64, while incurring nothing obvious loss in the reconstructed picture quality and less increment in the bit rate. With the efficiency improvement of ME, the real-time performance of the encoder is further enhanced.

For the control allocation problem of flexible fly-wing aircraft with multi-control surfaces, the machine vibration force index was put forward to measure the elastic vibration. Total control allocation model was established, the superior performance of the Estimation of Distribution Algorithm (EDA) was used for solving the model. Firstly the rudder structure was designed, the way of work and control capability of every aerodynamic rudder were analyzed, and the rudder functional configuration was built in accordance with the rudder control efficiency of redundant rudder, elevator aileron and aileron rudder in aerodynamic data. During the control allocation, main performance indices of control allocation were analyzed, the overall multi-objective optimal evaluation function was established, which combined with the equality and inequality constraints, and solved by EDA. The true distribution was estimated by establishing a probability model, during the evolutionary process of EDA, the rudder would be allocated according to the deflection efficiency, the optimal solution was got by combining with the optimization function. At last, the impact of aero wing flexibility on static control performance of the system was analyzed. After considering aeroelasticity, the overshoot and transition time are decreases. The flying quality of flying wing aircraft is significantly improved, the system efficiency is improved by at least 10% after optimization. The simulation results show that the EDA can better solve the control allocation problem, and can improve the dynamic quality of the system, verifying the effectiveness of multi-control surfaces to control allocation.

Memory dependence prediction plays a very important role to reduce memory order violation and improve microprocessor performance. However, the traditional methods usually have large hardware overhead and poor realizability. Through the analysis of memory dependence's locality, this paper proposed a new memory predictor based on instruction distance. Compared to other memory dependence predictors, this predictor made full use of memory dependence's locality on instruction distance, predicted memory instruction' violation distance, controlled the speculation of a few instructions, finally deduced the number of memory order violation and improved the performance. The simulation results show that with only 1KB hardware budget, average Instruction Per Cycle (IPC) get a 1.70% speedup, and the most improvement is 5.11%. In the case of a small hardware overhead, the performance is greatly improved.

Ray tracing algorithm needs a great deal of computation time. To improve its efficiency, a parallel ray tracing model, based on the image theory and the framework of .NET Remoting, was proposed in this paper. It scheduled and started the remote computing object, and assigned masks dynamically through computing the completion description with the sub-tree of secondary visual source. The comparison among numeric results indicates that the parallel model considerably reduces the computation time without losing precision. It can be applied to urban microcellular environments with arbitrary building layouts and heights.

The issue of time delay estimation of narrowband audio frequency signal was studied, the signal model of time delay estimation was given, the traditional time delay estimation method of generalized correlation and the time delay estimation method based on the Hilbert transformation were studied, and then, a time delay estimation method based on the fractional Hilbert transformation was constructed in this paper. Finally, the mean square error curve of time delay estimation based on different fractional order was given through computer simulation. In the best case, compared with the estimation method of generalized correlation and Hilbert transformation, the simulation results show that the fractional Hilbert transformation method has better performance.

Streaming media technology has been widely used. In order to better use network resource and control the user's connections, a proxy method was proposed. It adjusted the data streaming in network using Real Time Streaming Protocol (RTSP), Real-time Control Protocol (RTCP) and Real-time Transport Protocol (RTP) between server and clients to implement a streaming media proxy to meet the requirement of different client connections. From the results of integration experiments, it shows that the proposed method is valid.

As emergency happens, the scheduling of rescue resources to multiple emergency locations is a realistic and intricate problem, especially when the available resources are limited. After analyzing the competition requirements of multiple emergency locations, a non-cooperative games model and algorithm for scheduling of rescue resources was presented. In the model, the players corresponded to various emergency locations, strategies to all resources scheduling and the payoff of each emergency location to the reciprocal of its scheduling cost. Thus, the optimal scheduling results were determined by the Nash equilibrium point of this game. Then the iterative algorithm was introduced to seek out the Nash equilibrium point. A numerical case test was given to demonstrate the feasibility and availability of the model.

Fractal image coding has high compression ratio, but the traditional fractal compression encoding method has the disadvantage of long processing time, because they need a lot of searching and matching for each range block to find a suitable domain block. This study shows that the domain block matching most of the range block is in the vicinity of the range block. According to this conclusion, an improved algorithm of fractal coding based on matching in range block's neighbourhood searching was presented, and the scope of the search was reduced by the information entropy difference of image block. In addition, the error image was coded as a supplement to improve the quality of the decoded image. Experimental results show that the coding time can be reduced greatly while the quality of reconstructed image is not much influenced.

A Genetic/Tabu hybrid optimization algorithm for Location-Routing Problems （LRP） with the soft time windows was researched, which can tackle both location-allocation problem and vehicle-routing problem. Hybrid strategy for Genetic Algorithm （GA）and Tabu Search algorithm （TS）, genetic coding and corresponding genetic operations were used in this proposed algorithm, so that the quality of the solution and the efficiency of the algorithm have been improved at the same time. And the results show the proposed algorithm is feasible and efficient.

In order to overcome the defect that the conventional color histogram retrieval method is prone to lose the spatial information of colors, an image retrieval method based on the largest color-connected regions was presented, and its rim roughness to capture the regional traits and reduce the absolute dependence on color. Then the similarity of the images is defined as the combination of the similarity of an integer and the similarity of the blocks to reflect the recognition process by people. The experimental result on real-world image collections indicates that the proposed approach significantly improves image retrieval accuracy.

Stereo pair acquisition of a scene is the key to binocular stereo imaging. This paper presented a stereo pair creation method when 3D models were constructed. Using camera objects in 3DS MAX, the method started from a coordinate transformation of objects in the scene based on principle of binocular stereo vision. Then the method carried out the perspective transformation to create left image and right image respectively. The results of the experiment indicate the position of the two target cameras and the 3D model, together with the length of the base line is the key factor that affects the stereo effect. Changing the position of the target cameras and the 3D model may result in positive disparity or negative disparity stereo pairs. When the aspect ratio of AB to CO equals 0.05, the stereo effect of the stereo pairs created is better.

Based on Object Constraint Language (OCL) and Event Condition Action (ECA), a temporal extending method was proposed for enterprise business rules and constraints, which used temporal operators and time intervals to refer to history information of temporal objects and temporal properties. The relationship between business objects and ECA rules was also analyzed.

To support the modeling of time-related information such as historical information, an enterprise temporal modeling was proposed, involving calendar objects, time attribute domain types, and timestamps. With these concepts and their meta-models, model designers can build temporal enterprise models based on the current snapshot models so as to increase the flexibility of models and information systems.

A new method of using patterns reusing to integrate models of enterprise legacy systems was proposed. The process of legacy systems integration was introduced. A case was used to explain how to use patterns. At last, some practicable solutions for existing problems in model integration of legacy systems were given.